A Completeness Result for Finite λ-bisimulations
نویسنده
چکیده
We show that finite λ-bisimulations (closely related to bisimulations up to context) are sound and complete for finitely generated λ-bialgebras for distributive laws λ of a monad T on Set over an endofunctor F on Set, such that F preserves weak pullbacks and finitely generated T -algebras are closed under taking kernel pairs. This result is used to infer the decidability of weighted language equivalence when the underlying semiring is a subsemiring of an effectively presentable Noetherian semiring. These results are closely connected to [ÉM10] and [BMS13], concerned with respectively the decidability and axiomatization of weighted language equivalence w.r.t. Noetherian semirings.
منابع مشابه
Simulations and Bisimulations for Coalgebraic Modal Logics
Simulations serve as a proof tool to compare the behaviour of reactive systems. We define a notion of Λ-simulation for coalgebraic modal logics, parametric in the choice of a set Λ of monotone predicate liftings for a functor T . That is, we obtain a generic notion of simulation that can be flexibly instantiated to a large variety of systems and logics, in particular in settings that semantical...
متن کاملHereditary History Preserving Bisimilarity Is Undecidable
We show undecidability of hereditary history preserving bisimilarity for finite asynchronous transition systems by a reduction from the halting problem of deterministic 2-counter machines. To make the proof more transparent we introduce an intermediate problem of checking domino bisimilarity for origin constrained tiling systems. First we reduce the halting problem of deterministic 2-counter ma...
متن کاملModal Characterisations of Probabilistic and Fuzzy Bisimulations
This paper aims to investigate bisimulation on fuzzy systems. For that purpose we revisit bisimulation in the model of reactive probabilistic processes with countable state spaces and obtain two findings: (1) bisimilarity coincides with simulation equivalence, which generalises a result on finite-state processes originally established by Baier; (2) the modal characterisation of bisimilarity by ...
متن کاملCompleteness Results for Higher - Order Equational Logic submitted
We present several results concerning deductive completeness of the simply typed λcalculus with constants and equational axioms. First, we prove deductive completeness of the calculus with respect to standard semantics for axioms containing neither free nor bound occurrences of higher-order variables. Using this result, we analyze some fundamental deductive and semantic properties of axiomatic ...
متن کامل2 5 Ju n 20 14 Atom – canonicity , complete representations for cylindric – like algebras , and omitting types in clique guarded
Fix a finite ordinal n > 2. We show that there exists an atomic, simple and countable representable CAn, such that its Dedekind–MacNeille completion is outside SNrnCAn+3. Hence, for any finite k ≥ 3, the variety SNrnCAn+k is not atom–canonical, so that the variety of CAns having n + k–flat representations is not atom–canonical, too. We show, for finite k ≥ 3, that ScNrnCAn+k is not elementary, ...
متن کامل